#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, m;
int v[N], w[N], s[N];
int f[N];

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> v[i] >> w[i] >> s[i];
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = m; j >= v[i]; --j) {
			for (int k = 0; k <= s[i]; ++k) {
				if (j >= k * v[i]) {
					f[j] = max(f[j], f[j - k * v[i]] + k * w[i]);
				}
			}
		}
	}
	cout << f[m] << endl;
	return 0;
}